A separable integer programming problem equivalent to its continual version

Solving a Fully Fuzzy Multiobjective Programming Problem using its Equivalent Weighted Goal Programming Problem

This paper introduces a computational method of solving fully fuzzy multi objective linear programming problem through goal programming approach. Here we deal the imprecise parameters as fuzzy numbers with assumption that these fuzzy numbers have some possibility distribution associated with fuzzy variables. In the study, we extend the concept of conflict and non-conflict between objective func...

Quadratic Integer Programming: Complexity and Equivalent Forms

Modified Gauss Elimination Technique for Separable Nonlinear Programming Problem

Integer Programming: Optimization and Evaluation Are Equivalent

We show that if one can find the optimal value of an integer linear programming problem in polynomial time, then one can find an optimal solution in polynomial time. We also present a proper generalization to (general) integer programs and to local search problems of the well-known result that optimization and augmentation are equivalent for 0/1-integer programs. Among other things, our results...

Planar Integer Linear Programming is NC Equivalent to Euclidean GCD

It is not known if planar integer linear programming is P-complete or if it is in NC, and the same can be said about the computation of the remainder sequence of the Euclidean algorithm applied to two integers. However, both computations are NC equivalent. The latter computational problem was reduced in NC to the former one by Deng [Mathematical Programming: Complexity and Application, Ph.D. di...